//Given an integer n, return the number of trailing zeroes in n!. 
//
// Follow up: Could you write a solution that works in logarithmic time complexi
//ty? 
//
// 
// Example 1: 
//
// 
//Input: n = 3
//Output: 0
//Explanation: 3! = 6, no trailing zero.
// 
//
// Example 2: 
//
// 
//Input: n = 5
//Output: 1
//Explanation: 5! = 120, one trailing zero.
// 
//
// Example 3: 
//
// 
//Input: n = 0
//Output: 0
// 
//
// 
// Constraints: 
//
// 
// 0 <= n <= 104 
// 
// Related Topics 数学 
// 👍 459 👎 0


package leetcode.editor.cn;
//Java：Factorial Trailing Zeroes
 class P172FactorialTrailingZeroes{
    public static void main(String[] args) {
        Solution solution = new P172FactorialTrailingZeroes().new Solution();
        // TO TEST
    }
    //leetcode submit region begin(Prohibit modification and deletion)
class Solution {
    public int trailingZeroes(int cout) {
        int num = 0;
        while (cout != 0) {
            num += cout / 5;
            cout /= 5;
        }
        return num;
    }
}
//leetcode submit region end(Prohibit modification and deletion)

}